Order optimization

XPS optimizes all work instructions for a given ASC stack. The optimization algorithm evaluates both an idle crane's location and its active work load and decides which job the crane should perform. This decision is based on the following rules:

Based on these rules, you can easily determine why XPS chose one job over another. If you want to influence the decision to achieve an alternative outcome that better fits your unique business demands and operational practices, you can fine-tune order optimization. For example, you can define when a gate wait time should override a marine wait time, at what savings unladen time should win against a service demand, and when XPS should split or shorten a job. For more information, see Setting up block optimization (on page 1) in the online help or on the Kaleris Community Portal.

Order optimization requires the following conditions:

If a crane is online and manual, this means someone is physically controlling it, for example in case of a remote operator handling the direct dispatch to trucks.

For more information, see ASC availability (on page 1).

When optimizing transport orders, XPS performs the following steps:

  1. Starts the optimization engine for the selected ASC block.

  1. Collects all active work instructions into, out of, and within the selected ASC stack.

  2. Eliminates unfeasible work instructions.

The decision to eliminate certain work instructions is based on an ASC's access to transfer zones and the performance of the other ASC in the block. For example, this prevents an ASC from getting a job that is in the way of another ASC's work, keeping the two ASCs in the stack from needing to pass each other.

  1. Determines work instructions that can be split or shortened. This concerns long jobs that are beyond the ASC's range or occur during busy periods. For details, see Split work instructions (on page 1).

  2. Calculates job schedules for the remaining work instructions.

  3. Dispatches the first work instruction in the schedule, which is the one with the lowest score.

This flow differs in the following cases: